منابع مشابه
Permutations in the factorization of simplex bases
The basis matrices corresponding to consecutive iterations of the simplex method only differ in a single column. This fact is commonly exploited in current LP solvers to avoid having to compute a new factorization of the basis at every iteration. Instead, a previous factorization is updated to reflect the modified column. Several methods are known for performing the update, most prominently the...
متن کاملA transposition factorization of walk-permutations in graphs
Let G be a graph, e, , . . . . e, E E(G) edges, u1 , . . . . u,, oi, . . . . u, E V(G) vertices, such that (ui, vi) are the ends of ei, 1 < i < n. We follow the notations and definitions of [l, p. 121, but with a slight change in the notations of a walk: The sequence w=e,...e,~(u,e,u,)(~~e~u~)...(~~e~u,) is a walk if and only if vi = ui + i, 1~ i < IZ 1. In that case we also denote ~n=%+l~ and ...
متن کاملCounting permutations and polynomials with a restricted factorization pattern
We determine the asymptoti probability that a polynomial of degree n over a nite eld with q elements has no more than k irredu ible fa tors of any degree, for ea h natural number k. In parti ular we show that when q is large, almost 90% of su h polynomials have no more than 2 irredu ible fa tors of any given degree and almost 98% have no more than 3 irredu ible fa tors of any given degree. Simi...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کامل$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorization property of level $kappa$ for $X^*$ with respect to $f$ and automatically boundedness and $w^*$-$w^*$-continuity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2015
ISSN: 1081-3810
DOI: 10.13001/1081-3810.2849